Data structures - PDFSEARCH.IO - Document Search Engine

Data structures
Results: 1048

#	Item
171	Opportunistic Data Structures with Applications Paolo Ferragina∗ Giovanni Manzini† Abstract Add to Reading List Source URL: people.unipmn.it Language: English Arrays Analysis of algorithms Suffix array Suffix tree String searching algorithm Time complexity Trie FO Logarithm Big O notation Compressed suffix array Rope
172	Course Syllabus: CS 141: Intermediate Data Structures and Algorithms Winter, 2009 Course Description: Basic algorithm analysis techniques; asymptotic complexity; big-O and big-Omega notations; induction and recurrence re Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-01-07 13:50:34 Operations research Algorithms Introduction to Algorithms Mathematical optimization Divide and conquer algorithms Greedy algorithm Dynamic programming Sorting algorithm
173	A Constructive Approach for Proving Data Structures’ Linearizability ? Kfir Lev-Ari1 , Gregory Chockler2 , and Idit Keidar1 Add to Reading List Source URL: webee.technion.ac.il Language: English - Date: 2015-08-17 06:31:40 Concurrency control Transaction processing Linearizability Algorithm Concurrent computing Parallel computing
174	5 Algorithms and Data Structures © N. WirthOberon version: AugustContents Preface Add to Reading List Source URL: acm.mipt.ru Language: English - Date: 2011-10-24 05:17:36 Data types Pascal Pointer Associative array Algorithm Array data type Data structure Assignment Programming language Modula-2 APL Data
175	Algorithms and Data Structures Winter TermExercises for Units 12 and 13 s 1. If you feel uneasy with treaps, draw a few examples and test insertions and deletions. Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-08 02:47:54 Binary trees Data types Treap Search algorithms Binary search tree Lowest common ancestor B-tree Finger search Tree Geometry of binary search trees
176	POLICY FORUM SCIENCE AND GOVERNMENT Appropriate professional and career reward structures are necessary (20–22). The way scientists are being evaluated and how their careers are shaped are at stake. For example, resear Add to Reading List Source URL: www.codata.info Language: English - Date: 2013-06-25 01:00:00 Open access Academic publishing Scholarly communication Scientific method Data publishing Data sharing Neuroinformatics Funding of science E-Science Research Organisation for Economic Co-operation and Development Research data archiving
177	Efficient Selectivity Estimation by Histogram Construction based on Subspace Clustering A. Khachatryan, E. Müller, K. Böhm, J. Kopper Institute for Program Structures and Data Organization (IPD) SSDBM‘Jul Add to Reading List Source URL: ssdbm2011.ssdbm.org Language: English - Date: 2011-09-01 19:37:02 Nonparametric statistics Histogram Cluster analysis Query optimization
178	Library and IT Considerations Web-based Database of the Syntactic Structures of the World’s Languages Nov 10, 2007 Add to Reading List Source URL: linguistics.as.nyu.edu Language: English - Date: 2009-08-25 12:37:44 Semantic Web Open data DBpedia Java platform TACTIC Creative Commons license Wikipedia Database Schema-agnostic Databases
179	CPSC 211 Data Structures & Implementations (c) Texas A&M UniversityCompiling and Running a C Program in Unix Simple scenario in which your program is in a single Add to Reading List Source URL: twiki.di.uniroma1.it Language: English - Date: 2006-08-22 07:22:25 Subroutines Printf format string Scanf format string Recursion Global variable C standard library Function prototype Type signature Getopt Function pointer
180	Modeling multi-way data can be accomplished using tensors, which are data structures indexed along three or more dimensions. Tensor factorization is increasingly used to analyze extremely large and sparse multi-way datas Add to Reading List Source URL: mmds-data.org Language: English - Date: 2016-06-23 15:50:48 Tensors Tensor OpenMP Graph factorization Splatt Tensor software

UPDATE